Carrying Capacity in Barabási-Albert Network
نویسنده
چکیده
The effect of finiteness in degree number is analyzed on a growing network. The dynamics is governed by a rule where the degree number increases under a scheme similar to the Malthus-Verhulst model in the context of population growth. One notices that the second moment of degree is closely related to the linking probability of this growing network. The degree distribution is analyzed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time.
منابع مشابه
On merging and dividing of Barabási-Albert-graphs
The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albertmodel, and five strategies to reverse the...
متن کاملComment on “Control profiles of complex networks”
Ruths and Ruths (Reports, 21 March 2014, p. 1373) find that existing synthetic random network models fail to generate control profiles that match those found in real network models. Here, we show that a straightforward extension to the Barabási-Albert model allows the control profile to be “tuned” across the control profile space, permitting more meaningful control profile analyses of real netw...
متن کاملDetermination of Lateral load Capacity of Steel Shear Walls Based on Artificial Neural Network Models
In this paper, load-carrying capacity in steel shear wall (SSW) was estimated using artificial neural networks (ANNs). The SSW parameters including load-carrying capacity (as ANN’s target), plate thickness, thickness of stiffener, diagonal stiffener distance, horizontal stiffener distance and gravity load (as ANN’s inputs) are used in this paper to train the ANNs. 144 samples data of each of th...
متن کاملConstruction of Scale-Free Networks with Adjustable Clustering
A complex network is characterized by its degree distribution and clustering coefficient. Given a scale-free network, we propose a node-reconnection algorithm that can alter the clustering coefficient of the network while keeping the degree of each node unchanged. Results are shown when the algorithm is applied to reconnect the nodes of scale-free networks constructed using the Barabási-Albert ...
متن کاملEffective usage of shortest paths promotes transportation efficiency on scale-free networks
With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.6447 شماره
صفحات -
تاریخ انتشار 2014